Multiparty Testing Preorders
نویسندگان
چکیده
Variants of the must testing approach have been successfully applied in Service Oriented Computing for analysing the compliance between (contracts exposed by) clients and servers or, more generally, between two peers. It has however been argued that multiparty scenarios call for more permissive notions of compliance because partners usually do not have full coordination capabilities. We propose two new testing preorders, which are obtained by restricting the set of potential observers. For the first preorder, called uncoordinated, we allow only sets of parallel observers that use different parts of the interface of a given service and have no possibility of intercommunication. For the second preorder, that we call individualistic, we instead rely on parallel observers that perceive as silent all the actions that are not in the interface of interest. We have that the uncoordinated preorder is coarser than the classical must testing preorder and finer than the individualistic one. We also provide a characterisation in terms of decorated traces for both preorders: the uncoordinated preorder is defined in terms of must-sets and Mazurkiewicz traces while the individualistic one is described in terms of classes of filtered traces that only contain designated visible actions and must-sets.
منابع مشابه
Completeness and Logical Full Abstraction in Modal Logics for Typed Mobile Processes
We study an extension of Hennessy-Milner logic for the π-calculus which gives a sound and complete characterisation of representative behavioural preorders and equivalences over typed processes. New connectives are introduced representing actual and hypothetical typed parallel composition and hiding. We study three compositional proof systems, characterising the May/Must testing preorders and b...
متن کاملChoreographies and Behavioural Contracts on the Way to Dynamic Updates
We survey our work on choreographies and behavioural contracts in multiparty interactions. In particular theories of behavioural contracts are presented which enable reasoning about correct service composition (contract compliance) and service substitutability (contract refinement preorder) under different assumptions concerning service communication: synchronous address or name based communica...
متن کاملCompositional Testing Preorders for Probabilistic Processes
Transition systems are well-established as a semantic model for distributed systems. There are widely accepted preorders that serve as criteria for reenement of a more abstract transition system to a more concrete one. To reason about probabilistic phenomena such as failure rates, we need to extend models and methods that have proven successful for non-probabilistic systems to a probabilistic s...
متن کاملOn Full Abstractness for Fair Testing
Fair-testing preorders were introduced in 13, 3] in order to overcome diiculties that traditional testing/failures preorders have in tackling divergent behavior. This paper establishes the appropriateness and \optimality" of the fair-must precongruence by proving that it is the coarsest precongruence respecting a natural notion of observable behavior (maximal traces) under a non-catastrophic in...
متن کاملTechnical Report 2009-003 A Testing Theory for Real-Time Systems
We develop a testing theory for real-time systems. We keep the usual notion of success or failure (based on finite runs) but we also provide a mechanism of determining the success or failure of infinite runs, using a formalism similar to the acceptance in Büchi automata. We present two refinement timed preorders similar to De Nicola and Hennessy’s may and must testing. We then provide alternati...
متن کامل